Reconstructing Binary Matrices under Window Constraints from their Row and Column Sums
نویسندگان
چکیده
The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical consistency and reconstruction problems for two directions in discrete tomography can be solved in polynomial time, it turns out that these window constraints cause various unexpected complexity jumps back and forth from polynomial-time solvability to NP-hardness.
منابع مشابه
Reconstructing Convex Matrices by Integer Programming Approaches
We consider the problem of reconstructing two-dimensional convex binary matrices from their row and column sums with adjacent ones. Instead of requiring the ones to occur consecutively in each row and column, we maximize the number of adjacent ones. We reformulate the problem by using integer programming and we develop approximate solutions based on linearization and convexification techniques.
متن کاملReconstruction of Binary Matrices Satisfying Neighborhood Constraints by Simulated Annealing
This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results ...
متن کاملOn the Ambiguity of Reconstructing hv-Convex Binary Matrices with Decomposable Configurations
Reconstructing binary matrices from their row, column, diagonal, and antidiagonal sums (also called projections) plays a central role in discrete tomography. One of the main difficulties in this task is that in certain cases the projections do not uniquely determine the binary matrix. This can yield an extremely large number of (sometimes very different) solutions. This ambiguity can be reduced...
متن کاملMatrices with Prescribed Row and Column Sums
This is a survey of the recent progress and open questions on the structure of the sets of 0-1 and non-negative integer matrices with prescribed row and column sums. We discuss cardinality estimates, the structure of a random matrix from the set, discrete versions of the Brunn-Minkowski inequality and the statistical dependence between row and column sums.
متن کاملAsymptotic Enumeration of Binary Matrices with Bounded Row and Column Sums
Let An be the set of all n×n binary matrices in which the number of 1’s in each row and column is at most n/2. We show that |An| = 2n−ρn+δ √ n · nO(1), for a constant ρ ≈ 1.42515, and δ = δ(n) ≈ 1.46016 for even n and 0 otherwise.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 155 شماره
صفحات -
تاریخ انتشار 2017